Deterministic Compressed Sensing Matrices: Construction via Euler Squares and Applications
نویسندگان
چکیده
منابع مشابه
Deterministic Construction of Compressed Sensing Matrices using BCH Codes
In this paper we introduce deterministic m×n RIP fulfilling ±1 matrices of order k such that log m log k ≈ log(log2 n) log(log2 k) . The columns of these matrices are binary BCH code vectors that their zeros are replaced with −1 (excluding the normalization factor). The samples obtained by these matrices can be easily converted to the original sparse signal; more precisely, for the noiseless sa...
متن کاملNew Construction of Deterministic Compressed Sensing Matrices via Singular Linear Spaces over Finite Fields
As an emerging approach of signal processing, not only has compressed sensing (CS) successfully compressed and sampled signals with few measurements, but also has owned the capabilities of ensuring the exact recovery of signals. However, the above-mentioned properties are based on the (compressed) sensing matrices. Hence the construction of sensing matrices is the key problem. Compared with the...
متن کاملDeterministic constructions of compressed sensing matrices
Compressed sensing is a new area of signal processing. Its goal is to minimize the number of samples that need to be taken from a signal for faithful reconstruction. The performance of compressed sensing on signal classes is directly related to Gelfand widths. Similar to the deeper constructions of optimal subspaces in Gelfand widths, most sampling algorithms are based on randomization. However...
متن کاملDeterministic construction of Fourier-based compressed sensing matrices using an almost difference set
In this paper, a new class of Fourier-based matrices is studied for deterministic compressed sensing. Initially, a basic partial Fourier matrix is introduced by choosing the rows deterministically from the inverse discrete Fourier transform (DFT) matrix. By row/column rearrangement, the matrix is represented as a concatenation of DFT-based submatrices. Then, a full or a part of columns of the c...
متن کاملDeterministic Construction of RIP Matrices in Compressed Sensing from Constant Weight Codes
The expicit restricted isometry property (RIP) measurement matrices are needed in practical application of compressed sensing in signal processing. RIP matrices from Reed-Solomon codes, BCH codes, orthogonal codes, expander graphs have been proposed and analysised. On the other hand binary constant weight codes have been studied for many years and many optimal or near-optimal small weight and d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2016
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2016.2550020